Infinite Circulant Digraphs and Random Infinite Circulant Digraphs
نویسندگان
چکیده
In this paper, we completely determine the connectivity of every infinite circulant digraphs and prove that almost all infinite circulant digraphs are infinitely strongly connected and therefore have both oneand two-way infinite Hamiltonian paths.
منابع مشابه
Dichromatic number, circulant tournaments and Zykov sums of digraphs
The dichromatic number dc(D) of a digraph D is the smallest number of colours needed to colour the vertices of D so that no monochromatic directed cycle is created. In this paper the problem of computing the dichromatic number of a Zykov-sum of digraphs over a digraph D is reduced to that of computing a multicovering number of an hypergraph H1(D) associated to D in a natural way. This result al...
متن کاملRecognizing Bipartite Incident-Graphs of Circulant Digraphs
Knödel graphs and Fibonacci graphs are two classes of bipartite incident-graph of circulant digraphs. Both graphs have been extensively studied for the purpose of fast communications in networks, and they have deserved a lot of attention in this context. In this paper, we show that there exists an O(n log n)-time algorithm to recognize Knödel graphs, and that the same technique applies to Fibon...
متن کاملCycles in 3-anti-circulant digraphs
A digraph D is a 3-anti-circulant digraph, if for any four distinct vertices x1, x2, x3, x4 ∈ V (D), x1 → x2 ← x3 → x4 implies x4 → x1. In this paper, we characterize the structure of 3-anti-circulant digraphs containing a cycle factor and show that the structure is very close to semicomplete and semicomplete bipartite digraphs. Laborde et al. conjectured that every digraph has an independent s...
متن کاملCharacterization of c-circulant digraphs of degree two which are circulant
A c-circulant digraph G,(c, A) has Z,V as its vertex set and adjacency rules given by .X + cs + a with a E A c Z,. The c-circulant digraphs of degree two which are isomorphic to some circulant digraph are characterized, and the corresponding isomorphism is given. Moreover. a sufficient condition is obtained for a c-circulant digraph to be a Cayley digraph.
متن کاملCirculant Homogeneous Factorisations of Complete Digraphs Kpd with p an Odd Prime
Let F = (Kn,P) be a circulant homogeneous factorisation of index k, that means P is a partition of the arc set of the complete digraph Kn into k circulant factor digraphs such that there exists σ ∈ Sn permuting the factor circulants transitively amongst themselves. Suppose further such an element σ normalises the cyclic regular automorphism group of these circulant factor digraphs, we say F is ...
متن کامل